Belief Propagation Guided Decimation Fails on Random Formulas
نویسندگان
چکیده
منابع مشابه
On Belief Propagation Guided Decimation for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-constructive arguments show that Φ is satisfiable for clause/variable ratios m/n ≤ rk ∼ 2 ln 2 with high probability. Yet no efficient algorithm is know to find a satisfying assignment for densities as low as m/n ∼ rk · ln(k)/k with a non-vanishing probability. In fact, the density m/n ∼ rk · ln(k)/k seems...
متن کاملSolving Constraint Satisfaction Problems through Belief Propagation-guided decimation
Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as ‘decimation,’ with reference to ana...
متن کاملAnalysing Survey Propagation Guided Decimationon Random Formulas
Let ~ Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. For clauses/variables ratio m/n ≤ rk-SAT ∼ 2 ln 2 the formula ~ Φ is satisfiable with high probability. However, no efficient algorithm is known to provably find a satisfying assignment beyond m/n ∼ 2k ln(k)/k with a non-vanishing probability. Non-rigorous statistical mechanics work on k-CNF led to the devel...
متن کاملOn the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms
We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models. This method is developed in the particular case of partially decimated random constraint satisfaction problems. This allows to develop a theoretical understanding of a class of algorit...
متن کاملPerformance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem
We show that the Survey Propagation guided decimation algorithm fails to find satisfying assignments on random instances of the “Not-All-Equal-K-SAT” problem, well below the satisfiability threshold. Our analysis applies to a broad class of algorithms that may be described as “sequential local algorithms” — such algorithms iteratively set variables based on some local information and/or local r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2017
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3005398